Response Time Distribution in a Tandem Pair of Queues with Batch Processing
نویسندگان
چکیده
Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and departures. The method uses conditional forward reversed node sojourn times derives the Laplace transform response probability function case that sizes are finite. result derived by generating takes into account path not overtake-free sense tagged task being tracked affected later at second queue. A novel aspect vector functions solved for, rather than single scalar-valued function, which requires investigation singularities certain matrix. recurrence formula to obtain arbitrary moments differentiation origin, these can be computed rapidly iteration. Numerical results for first four displayed some sample networks have product-form solutions their equilibrium queue length probabilities, along densities themselves numerical inversion transform. Corresponding approximations also (non-product-form) pairs “raw” batch-queues—with no special arrivals—and validated against regenerative simulation, indicates good accuracy. methods appropriate modeling bursty internet cloud traffic possible role energy-saving considered.
منابع مشابه
Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at the first queue. We first characterize the distribution of L(m,n) exactly for every m and n, under the assumption that the queues have unlimited buffers and th...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملConvexity in tandem queues
We derive convexity results and related properties for the value functions of tandem queueing systems. The results for standard multi-server queues are new. For completeness we also prove and generalize existing results on tandems of controllable queues. The results can be used to compare queueing systems. This is done for systems with and without batch arrivals, and for systems with different ...
متن کاملA Mathematical Model for City Logistics Distribution Network Design with the Aim of Minimizing Response Time
Recently, urbanization has been expanded rapidly in the world and a number of metropolitan areas have been appeared with a population of more than 10 million people. Because of dense population in metropolitan and consequently increasing the delivery of goods and services, there has been a lot of problems including traffic congestion, air pollution, accidents and high energy consumption. This m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2021
ISSN: ['0004-5411', '1557-735X']
DOI: https://doi.org/10.1145/3448973